FREQUENCY-DOMAIN ANALYSES OF NONLINEARLY LOADED ANTENNA ARRAYS USING SIMULATED ANNEALING ALGORITHMS
نویسندگان
چکیده
منابع مشابه
Nonlinear Analysis of Nonlinearly Loaded Dipole Antenna in the Frequency Domain Using Fuzzy Inference
In this paper, inference model is proposed so as to analyze nonlinearly loaded dipole antenna. In modeling process, linear and nonlinear behavior of the problem is saved as simple and unchanged membership functions and the effect of incident wave on the induced voltage at different harmonies are then extracted easily. Consequently the model achieved is more efficient than previous studies using...
متن کاملScheduling signal processing tasks for antenna arrays with simulated annealing
The problem dealt with in this paper is the design of a parallel embedded system with the minimal number of processors. The system is designed to solve signal processing tasks using data collected from antenna arrays. Simulated annealing algorithm is used to find the minimal number of processors and the optimal system configuration.
متن کاملParallel Simulated Annealing Algorithms
n different nodes of the network. The two algorithms have been applied to the job shop scheduling problem (JSS) and the traveling salesman problem (TSP). Both algorithms showed very good performance in terms of solution time and solution quality. The rest of the paper is organized in the following fashion. Section II describes the simulated annealing technique. Section III presents the cluster ...
متن کاملSynthesis of Sparse Cylindrical Arrays Using Simulated Annealing Algorithm
Abstract—In this paper, simulated annealing algorithm (SA) is applied to the synthesis of cylindrical conformal arrays in order to suppress the peaks of side lobes by acting on the elements’ positions. There are multiple optimization constraints including the number of elements, aperture and minimum element spacing. A constraint matrix is designed to make the solution meet the restriction on th...
متن کاملNew bounds for binary covering arrays using simulated annealing
Covering arrays (CAs) are combinatorial structures specified as a matrix of N rows and k columns over an alphabet on v symbols such that for each set of t columns (called the strength of the array) every t-tuple of symbols is covered. Recently they have been used to represent interaction test suites for software testing given that they provide economical sized test cases while still preserving ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress In Electromagnetics Research
سال: 2005
ISSN: 1559-8985
DOI: 10.2528/pier04101501